TSTP Solution File: SET557^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET557^1 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:18:58 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 9 unt; 2 typ; 0 def)
% Number of atoms : 14 ( 4 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 8 ~; 3 |; 0 &; 31 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 19 ( 3 ^ 12 !; 4 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epred1_0: $i > $i > $o ).
thf(decl_23,type,
esk1_1: ( $i > $o ) > $i ).
thf(surjectiveCantorThm,conjecture,
~ ? [X1: $i > $i > $o] :
! [X2: $i > $o] :
? [X3: $i] :
( ( X1 @ X3 )
= X2 ),
file('/export/starexec/sandbox2/tmp/tmp.rBEgAHzWbJ/E---3.1_413.p',surjectiveCantorThm) ).
thf(c_0_1,negated_conjecture,
~ ~ ? [X1: $i > $i > $o] :
! [X2: $i > $o] :
? [X3: $i] :
( ( X1 @ X3 )
= X2 ),
inference(assume_negation,[status(cth)],[surjectiveCantorThm]) ).
thf(c_0_2,negated_conjecture,
! [X8: $i > $o] :
( ( epred1_0 @ ( esk1_1 @ X8 ) )
= X8 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: $i > $o] :
( ( epred1_0 @ ( esk1_1 @ X2 ) )
= X2 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: $i > $o,X10: $i] :
( ( epred1_0 @ ( esk1_1 @ X2 ) @ X10 )
<=> ( X2 @ X10 ) ),
inference(arg_cong,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i > $o,X3: $i] :
( ( epred1_0 @ ( esk1_1 @ X2 ) @ X3 )
| ~ ( X2 @ X3 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i > $o,X3: $i] :
( ( epred1_0
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X2 @ Z0 ) )
@ X3 )
| ( X2 @ X3 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i > $o,X3: $i] :
( ( X2 @ X3 )
| ~ ( epred1_0 @ ( esk1_1 @ X2 ) @ X3 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
( epred1_0
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 @ Z0 ) )
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 @ Z0 ) ) ),
inference(ef,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET557^1 : TPTP v8.1.2. Released v3.6.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:52:48 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.rBEgAHzWbJ/E---3.1_413.p
% 0.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.50 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.50 # new_bool_9 with pid 554 completed with status 0
% 0.21/0.50 # Result found by new_bool_9
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.50 # Search class: HUUPF-FFSF11-SSSFFFBN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting post_as_ho10 with 163s (1) cores
% 0.21/0.50 # post_as_ho10 with pid 566 completed with status 0
% 0.21/0.50 # Result found by post_as_ho10
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.50 # Search class: HUUPF-FFSF11-SSSFFFBN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting post_as_ho10 with 163s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 1
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 1
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 1
% 0.21/0.50 # Processed clauses : 17
% 0.21/0.50 # ...of these trivial : 2
% 0.21/0.50 # ...subsumed : 3
% 0.21/0.50 # ...remaining for further processing : 12
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 33
% 0.21/0.50 # ...of the previous two non-redundant : 24
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 15
% 0.21/0.50 # Factorizations : 2
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 1
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 4
% 0.21/0.50 # ...of those cached : 1
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 10
% 0.21/0.50 # Positive orientable unit clauses : 5
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 4
% 0.21/0.50 # Current number of unprocessed clauses: 8
% 0.21/0.50 # ...number of literals in the above : 13
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 2
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 10
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 10
% 0.21/0.50 # Non-unit clause-clause subsumptions : 2
% 0.21/0.50 # Unit Clause-clause subsumption calls : 3
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 4
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1475
% 0.21/0.50 # Search garbage collected termcells : 15
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.006 s
% 0.21/0.50 # Maximum resident set size: 1628 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1692 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------